The Multiport Berth Allocation Problem with Speed Optimization: Exact Methods and a Cooperative Game Analysis

We consider a variant of the berth allocation problem—that is, multiport problem—aimed at assigning berthing times and positions to vessels in container terminals. This involves optimizing vessel travel speeds between multiple ports, thereby exploiting potentials collaboration carriers (shipping lines) terminal operators. Using graph representation problem, we reformulate an existing mixed-integer problem into generalized set partitioning which each variable refers sequence feasible berths ports that visits. By integrating column generation cut separation branch-and-cut-and-price procedure, our proposed method is able outperform commercial solvers benchmark instances adapt better larger instances. In addition, apply cooperative game theory methods efficiently distribute savings resulting from potential show both operators would benefit collaborating.